Infrared-image classification using hidden Markov trees
نویسندگان
چکیده
منابع مشابه
Infrared-Image Classification Using Hidden Markov Trees
Images of three-dimensional targets are characterized by the target subcomponents visible from a particular target-sensor orientation (target pose), with the image often changing quickly with variable pose. We define a class as a set of contiguous target-sensor orientations over which the associated target image is relatively stationary with aspect, and therefore each target is in general chara...
متن کاملInfrared-image classification using expansion matching filters and hidden Markov trees
Forward-looking infrared (FLIR) images of targets are characterized by the different target components visible in the image, with such dependent on the target-sensor orientation and target history (i.e., which target components are hot). We define a target class as a set of contiguous target-sensor orientations over which the associated image is relatively invariant, or statistically stationary...
متن کاملImage interpolation using wavelet based hidden Markov trees
Hidden Markov trees in the wavelet domain are capable of accurately modeling the statistical behavior of real world signals by exploiting relationships between coefficients in different scales. The model is used to interpolate images by predicting coefficients at finer scales. Various optimizations and post-processing steps are also investigated to determine their effect on the performance of t...
متن کاملBayesian Wavelet-Domain Image Modeling Using Hidden Markov Trees
Wavelet-domain hidden Markov models have proven to be useful tools. for statistical signal and image processing. The hidden Markov tree ( H M T ) model captures the key features of the joint statistics of the wavelet coeficients of real-world data. One potential drawback to the H M T framework is the need for computationally expensive iterative training (using the E M algorithm, fo r example). ...
متن کاملHidden Markov Decision Trees
We study a time series model that can be viewed as a decision tree with Markov temporal structure. The model is intractable for exact calculations, thus we utilize variational approximations . We consider three different distributions for the approximation: one in which the Markov calculations are performed exactly and the layers of the decision tree are decoupled, one in which the decision tre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2002
ISSN: 0162-8828
DOI: 10.1109/tpami.2002.1039210